排序方式: 共有68条查询结果,搜索用时 375 毫秒
1.
习主席在庆祝改革开放40周年大会上的重要讲话,是新时代改革开放再出发的宣言书和动员令。学习贯彻习主席重要讲话精神,关键要全面推进学校深化改革创新,深刻认清弘扬改革创新精神对于建设世界一流高等教育院校的重大意义,牢牢扭住全面深化改革创新的主攻方向,科学处理深化改革创新的重大关系,既以顽强的战略定力坚定不移深化改革,又运用科学的工作方法积极稳妥地推进改革。 相似文献
2.
陈建祥 《国防科技大学学报》1994,16(2):61-66
提出了一种通过坐标系移动,化原系中的大相对距离为新系中的小相对距离,以减小Hill方程在大相对距离时的模型误差的方法,即当拦截器的相对距离达到某一精度许可的值ρ_1时(定义ρ_1为精度控制参数,例如可取ρ_1=500km),以拦截器位置为原点,建立一假想的动参考系,将拦截器在原动系中的相对运动参数转换为新系中的相对运动参数(显然在新系中的初始相对距离),从而化大相对距离为小相对距离问题,提高Hill方程的描述精度。本文给出了方法的理论分析及两个计算机仿真实例,该法确可有效地减小Hill方程在大相对距离时的模型误差,结果是令人满意的。 相似文献
3.
机械构件的不同的失效模式之间具有一定的相关性,而且随机载荷作用次数对机械构件的可靠性有一定程度的影响。因此对机械构件进行可靠性灵敏度分析时,需要充分考虑其不同失效模式和载荷作用次数的影响。通过运用顺序统计量理论考虑载荷多次作用以及多种失效模式条件下机械构件可靠性及可靠性灵敏度的变化规律,运用随机摄动理论和四阶矩技术,建立一种考虑载荷作用次数的多失效模式机械构件可靠性灵敏度分析数值方法的应力强度干涉模型。在随机变量前四阶矩已知的情况下,结合灵敏度分析的梯度算法,推导出关于随机变量均值和方差的灵敏度计算公式。以某履带车辆底盘扭力轴为例进行计算,得到其可靠度随载荷作用次数、随机变量均值和方差而改变的可靠性灵敏度变化曲线,为扭力轴的可靠性优化提供一定的理论依据。研究成果可以推广到相关机械可靠性灵敏度设计和结构优化领域,具有非常重要的实用意义。 相似文献
4.
Sarah M. Ryan 《海军后勤学研究》2003,50(2):167-183
The combination of uncertain demand and lead times for installing capacity creates the risk of shortage during the lead time, which may have serious consequences for a service provider. This paper analyzes a model of capacity expansion with autocorrelated random demand and a fixed lead time for adding capacity. To provide a specified level of service, a discrete time expansion timing policy uses a forecast error‐adjusted minimum threshold level of excess capacity position to trigger an expansion. Under this timing policy, the expansion cost can be minimized by solving a deterministic dynamic program. We study the effects of demand characteristics and the lead time length on the capacity threshold. Autocorrelation acts similarly to randomness in hastening expansions but has a smaller impact, especially when lead times are short. However, the failure either to recognize autocorrelation or to accurately estimate its extent can cause substantial policy errors. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003 相似文献
5.
We study a stochastic inventory model of a firm that periodically orders a product from a make‐to‐order manufacturer. Orders can be shipped by a combination of two freight modes that differ in lead‐times and costs, although orders are not allowed to cross. Placing an order as well as each use of each freight mode has a fixed and a quantity proportional cost. The decision of how to allocate units between the two freight modes utilizes information about demand during the completion of manufacturing. We derive the optimal freight mode allocation policy, and show that the optimal policy for placing orders is not an (s,S) policy in general. We provide tight bounds for the optimal policy that can be calculated by solving single period problems. Our analysis enables insights into the structure of the optimal policy specifying the conditions under which it simplifies to an (s,S) policy. We characterize the best (s,S) policy for our model, and through extensive numerical investigation show that its performance is comparable with the optimal policy in most cases. Our numerical study also sheds light on the benefits of the dual freight model over the single freight models. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
6.
多目标拦截是弹道导弹防御的重大难题,也是目前美国导弹防御系统所遇到的最大的技术难点。在将多目标问题分为单弹头攻击和多弹头攻击2类问题的基础上,结合美国的相关研究计划,分别针对核爆炸防御、助推段防御、先进的目标识别器和多拦截器防御等多目标拦截策略进行了分析研究。 相似文献
7.
8.
9.
10.
In many practical manufacturing environments, jobs to be processed can be divided into different families such that a setup is required whenever there is a switch from processing a job of one family to another job of a different family. The time for setup could be sequence independent or sequence dependent. We consider two particular scheduling problems relevant to such situations. In both problems, we are given a set of jobs to be processed on a set of identical parallel machines. The objective of the first problem is to minimize total weighted completion time of jobs, and that of the second problem is to minimize weighted number of tardy jobs. We propose column generation based branch and bound exact solution algorithms for the problems. Computational experiments show that the algorithms are capable of solving both problems of medium size to optimality within reasonable computational time. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 823–840, 2003. 相似文献